Universal Binary Positive Definite Hermitian Lattices
نویسندگان
چکیده
منابع مشابه
Simple Proofs for Universal Binary Hermitian Lattices
It has been a central problem in the theory of quadratic forms to find integers represented by quadratic forms. The celebrated Four Square Theorem by Lagrange [10] was an outstanding result in this study. Ramanujan generalized this theorem and found 54 positive definite quaternary quadratic forms which represent all positive integers [13]. We call a positive definite quadratic form universal, i...
متن کاملEven Universal Binary Hermitian Lattices over Imaginary Quadratic Fields
A positive definite even Hermitian lattice is called even universal if it represents all even positive integers. We introduce a method to get all even universal binary Hermitian lattices over imaginary quadratic fields Q( √ −m) for all positive square-free integers m and we list optimal criterions on even universality of Hermitian lattices over Q( √ −m) which admits even universal binary Hermit...
متن کاملStrictly Hermitian Positive Definite Functions
Let H be any complex inner product space with inner product < ·, · >. We say that f : | C → | C is Hermitian positive definite on H if the matrix ( f(< z,z >) )n r,s=1 (∗) is Hermitian positive definite for all choice of z, . . . ,z in H, all n. It is strictly Hermitian positive definite if the matrix (∗) is also non-singular for any choice of distinct z, . . . ,z in H. In this article we prove...
متن کاملUniversal binary Hermitian forms
We will determine (up to equivalence) all of the integral positive definite Hermitian lattices in imaginary quadratic fields of class number 1 that represent all positive integers.
متن کاملPositive Definite and Semi-definite Splitting Methods for Non-hermitian Positive Definite Linear Systems
In this paper, we further generalize the technique for constructing the normal (or positive definite) and skew-Hermitian splitting iteration method for solving large sparse nonHermitian positive definite system of linear equations. By introducing a new splitting, we establish a class of efficient iteration methods, called positive definite and semi-definite splitting (PPS) methods, and prove th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Rocky Mountain Journal of Mathematics
سال: 2000
ISSN: 0035-7596
DOI: 10.1216/rmjm/1021477254